Greedy Construction of DNA Codes and New Bounds
نویسندگان
چکیده
In this paper, we construct linear codes over Z4 with bounded GCcontent. The codes are obtained using a greedy algorithm over Z4. Further, upper and lower bounds are derived for the maximum size of DNA codes of length n with constant GC-content w and edit distance d. keywords: DNA codes, GC-content, edit distance, upper and lower bounds.
منابع مشابه
Lexicographic Codes: Constructions Bounds, and Trellis Complexity
We study lexicographic codes, which are generated by an iterative greedy construction. We analyze the relationship between successive iterations in this construction, and derive bounds on the parameters of the resulting codes that are tighter than the presently known bounds. Furthermore, we generalize the lexico-graphic construction to produce families of codes that combine the excellent rate a...
متن کاملNew lower bounds and constructions for binary codes correcting asymmetric errors
In this correspondence, we study binary asymmetric errorcorrecting codes. A general construction for binary asymmetric error-correcting codes is presented. We show that some previously known lower bounds for binary asymmetric error-correcting codes can be obtained from this general construction. Furthermore, some new lower bounds for binary asymmetric error-correcting codes are obtained from th...
متن کاملTitle New lower bounds and constructions for binary codes correcting asymmetric errors
In this correspondence, we study binary asymmetric errorcorrecting codes. A general construction for binary asymmetric error-correcting codes is presented. We show that some previously known lower bounds for binary asymmetric error-correcting codes can be obtained from this general construction. Furthermore, some new lower bounds for binary asymmetric error-correcting codes are obtained from th...
متن کاملGreedy and Heuristic Algorithms for Codes and Colorings
Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is relatively small. With the motivation to improve lower bounds on the sizes of constant weight codes and asymmetric codes, we suggest a few greedy algorithms and other heuristic methods, which result in new, record-breaking codes. ...
متن کاملOptical orthogonal codes-New bounds and an optimal construction
Datatransmission Linköpings Universitet OC2005 – p. 1/46 References Optical orthogonal codes-new bounds and an optimal construction,
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1505.06262 شماره
صفحات -
تاریخ انتشار 2015